Better Algorithms through Faster Math

Better and Faster Patient Training

اقامت هرچه کوتاهتر بیمار در بیمارستان، مستلزم آموزش مؤثر او و خانواده وی است

Faster and Better Spectral Algorithms for Multi-Way Partitioning

In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed out in [3], the problem can be approximately transformed into the vector partitioning problem by mapping each circuit component to a multi-dimensional vector. The common key idea of our two algorithms for solving the v...

Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms

The classic algorithm of Viterbi computes the most likely path in a Hidden Markov Model (HMM) that results in a given sequence of observations. It runs in time O(Tn) given a sequence of T observations from a HMM with n states. Despite significant interest in the problem and prolonged effort by different communities, no known algorithm achieves more than a polylogarithmic speedup. In this paper,...

Better, faster, lighter Java

Sparser, Better, Faster GPU Parsing

Due to their origin in computer graphics, graphics processing units (GPUs) are highly optimized for dense problems, where the exact same operation is applied repeatedly to all data points. Natural language processing algorithms, on the other hand, are traditionally constructed in ways that exploit structural sparsity. Recently, Canny et al. (2013) presented an approach to GPU parsing that sacri...